Possibilistic rings detection for RICH pattern recognition
نویسندگان
چکیده
Leonard Studer Francesco Masulli IPHE Institut de Physique DISI Dipartimento di Informatica des Hautes Energies e Scienze del171nformazione Universitk de Lausanne Universiti degli Studi di Genova BSP, 10 1 5 Lausanne Via Dodecaneso, 35 Switzerland 1-16146 Genova, Italy Leonard. [email protected] INFM Istituto Nazionale per la Fisica della Materia Via Dodecaneso, 33 116 146 Genova, Italy [email protected] In this paper we present some results obtained using an algorithm whose core is the Possibilistic C-Spherical Shell algorithm, to detect complex images full of rings without any preliminary knowledge of number and position of the rings. This algorithm depends on the choice of several critical parameters. The statistical study described in this paper lead to high success rates even for large number of rings.
منابع مشابه
Possibilistic clustering approach to trackless ring Pattern Recognition in RICH counters
The pattern recognition problem in Ring Imaging CHerenkov (RICH) counters concerns the identification of an unknown number of rings whose centers and radii are assumed to be unknown. In this paper we present an algorithm based on the possibilistic approach to clustering that automatically finds both the number of rings and their position without any a priori knowledge. The algorithm has been te...
متن کاملRing Identification and Pattern Recognition in Ring Imaging Cherenkov (RICH) Detectors
An algorithm for identifying rings in Ring Imaging Cherenkov (RICH) detectors is described. The algorithm is necessarily Bayesian and makes use of a MetropolisHastings Markov chain Monte Carlo sampler to locate the rings. In particular, the sampler employs a novel proposal function whose form is responsible for significant speed improvements over similar methods. The method is optimised for fin...
متن کاملVector quantization in DCT domain using fuzzy possibilistic c-means based on penalized and compensated constraints
In this paper, fuzzy possibilistic c-means (FPCM) approach based on penalized and compensated constraints are proposed to vector quantization (VQ) in discrete cosine transform (DCT) for image compression. These approaches are named penalized fuzzy possibilistic c-means (PFPCM) and compensated fuzzy possibilistic c-means (CFPCM). The main purpose is to modify the FPCM strategy with penalized or ...
متن کاملLocal Derivative Pattern with Smart Thresholding: Local Composition Derivative Pattern for Palmprint Matching
Palmprint recognition is a new biometrics system based on physiological characteristics of the palmprint, which includes rich, stable, and unique features such as lines, points, and texture. Texture is one of the most important features extracted from low resolution images. In this paper, a new local descriptor, Local Composition Derivative Pattern (LCDP) is proposed to extract smartly stronger...
متن کاملOn relational possibilistic clustering
This paper initially describes the relational counterpart of possibilistic c-means (PCM) algorithm, called relational PCM (or RPCM). RPCM is then improved to better handle arbitrary dissimilarity data. First, a re-scaling of the PCM membership function is proposed in order to obtain zero membership values when the distance to prototype equals the maximum value allowed in bounded dissimilarity m...
متن کامل